On central max-point-tolerance graphs
نویسندگان
چکیده
منابع مشابه
Max Point-Tolerance Graphs
A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a pointed-interval (Iv, pv) where Iv is an interval of R and pv ∈ Iv such that uv is an edge of G iff Iu ∩ Iv ⊇ {pu, pv}. MPT graphs model relationships among DNA fragments in genome-wide association studies as well as basic transmission problems in telecommunications. We formally introduce this graph class, c...
متن کاملMax Point-Tolerance Graphs1
A graph G is a max point-tolerance (MPT) graph if each vertex v of G can be mapped to a pointed-interval (Iv, pv) where Iv is an interval of R and pv ∈ Iv such that uv is an edge of G iff Iu ∩ Iv ⊇ {pu, pv}. MPT graphs model relationships among DNA fragments in genome-wide association studies as well as basic transmission problems in telecommunications. We formally introduce this graph class, c...
متن کاملMin-Max Problems on Factor Graphs
We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. In this approach the min-max inference problem is reduced to a sequence of Constraint Satisfaction Problems (CSP), which allows us to solve the problem by sampling from a uniform dis...
متن کاملMin-Max Problems on Factor-Graphs
We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. This approach reduces the min-max inference problem to a sequence of constraint satisfaction problems (CSPs) which allows us to sample from a uniform distribution over the set of sol...
متن کاملOn max cut in cubic graphs
This paper is concerned with the maximum cut problem in parallel on cubic graphs. New theoretical results characterizing the cardinality of the cut are presented. These results make it possible to design a simple combinatorial O(log n) time parallel algorithm , running on a CRCW PRAM with O(n) processors. The approximation ratio achieved by the algorithm is 1: 3 and improves the best known para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2020
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2020.01.003